Adaptive Selection Problems in Networked Systems

Networked systems are composed of interconnected nodes that work collaboratively to maximize a given overall utility function. Typical examples of such systems are wireless sensor networks (WSNs) and participatory sensing systems: sensor nodes, either static or mobile, are deployed for monitoring a certain physical field. In these systems, there are a set of problems where we need to adaptively select a strategy to run the system, in order to enhance the efficiency of utilizing the resources available to the system. In particular, we study four adaptive selection problems as follows. We start by studying the problem of base-station (BS) selection in WSNs. Base stations are critical sensor nodes whose failures cause severe data losses. Deploying multiple fixed BSs improves the robustness, yet this scheme is not energy efficient because BSs have high energy consumptions. We propose a scheme that selects only one BS to be active at a time; other BSs are kept passive and act as regular sensor nodes. This scheme substantially reduces the energy supplies required by individual BSs. Then, we propose an algorithm for adaptively selecting the active BS so that the spatially and temporally varying energy resources are efficiently utilized. We also address implementation issues and apply the proposed algorithm on a real WSN. Field experiments have shown the effectiveness of the proposed algorithm. We generalize the BS selection problem by considering both the energy efficiency of regular sensor nodes and that of BSs. In this scheme, a subset of active BSs (instead of only one) is adaptively selected and the routing of regular sensor nodes is adjusted accordingly. Because BSs have high fixed-energy consumptions and because the number of candidate subsets of active BSs is exponential with the number of BSs, this general BS selection problem is NP-hard. We propose a polynomial-time algorithm that is guaranteed, under mild conditions, to achieve a network lifetime at least 62% of the optimal one. Through extensive numerical simulations, we verify that the lifetime achieved by the proposed algorithm is always very close to the optimum. We then study the problem of scheduling the sparse-sensing patterns in WSNs. We observe that the traditional scheme of periodically taking sensing samples is not energy efficient. Instead, we propose to adaptively schedule when and where to activate sensors for sampling a physical field, such that the energy efficiency is enhanced and the sensing precision is maintained. The schedules are learnt from the temporal signal models derived from the collected measurements. Then, using the obtained signal models and the sparse sensing-measurements, the original signal can be effectively recovered. This proposed method requires minimal on-board computation, no inter-node communications and achieves an appealing reconstruction performance. With experiments on real-world datasets, we demonstrate significant improvements over both traditional sensing schemes and the state-of-the-art sparse-sensing schemes, particularly when the measured data is characterized by a strong temporal correlation. In the last part of the thesis, we discuss the sparse-sensing framework by exploiting the spatial correlations rather than the temporal correlations among the captured measurements. In this